An Efficient Method to Learn Overcomplete Multi-Scale Dictionaries of ECG Signals
نویسندگان
چکیده
منابع مشابه
Entropy of Overcomplete Kernel Dictionaries
In signal analysis and synthesis, linear approximation theory considers a linear decomposition of any given signal in a set of atoms, collected into a so-called dictionary. Relevant sparse representations are obtained by relaxing the orthogonality condition of the atoms, yielding overcomplete dictionaries with an extended number of atoms. More generally than the linear decomposition, overcomple...
متن کاملLocal identification of overcomplete dictionaries
This paper presents the first theoretical results showing that stable identification of overcomplete μcoherent dictionaries Φ ∈ Rd×K is locally possible from training signals with sparsity levels S up to the order O(μ−2) and signal to noise ratios up to O( √ d). In particular the dictionary is recoverable as the local maximum of a new maximisation criterion that generalises the K-means criterio...
متن کاملLearning Sparsely Used Overcomplete Dictionaries
We consider the problem of learning sparsely used overcomplete dictionaries, where each observation is a sparse combination of elements from an unknown overcomplete dictionary. We establish exact recovery when the dictionary elements are mutually incoherent. Our method consists of a clustering-based initialization step, which provides an approximate estimate of the true dictionary with guarante...
متن کاملOn the Basis of Overcomplete Dictionaries
An important case of multiuser channel estimation is considered here, the problem of identifying the crosstalk that disturbs a DSL signal. Crosstalk originates from signals transmitted on nearby pairs in a telephone cable, and couples over unknown pair-to-pair crosstalk coupling channels into the pair carrying the signal. While crosstalk is generally the dominant impairment for current DSL syst...
متن کاملExact Recovery of Sparsely Used Overcomplete Dictionaries
We consider the problem of learning overcomplete dictionaries in the context of sparse coding, where each sample selects a sparse subset of dictionary elements. Our method consists of two stages, viz., initial estimation of the dictionary, and a clean-up phase involving estimation of the coefficient matrix, and re-estimation of the dictionary. We prove that our method exactly recovers both the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2018
ISSN: 2076-3417
DOI: 10.3390/app8122569